Computing sharp bounds for hard clustering problems on trees
نویسندگان
چکیده
منابع مشابه
Sharp Bounds on the PI Spectral Radius
In this paper some upper and lower bounds for the greatest eigenvalues of the PI and vertex PI matrices of a graph G are obtained. Those graphs for which these bounds are best possible are characterized.
متن کاملSharp bounds of the Zagreb indices of k-trees
A bound on the values of independence polynomials at-1/k for k-degenerate graphs", Discrete Mathematics 2013 (To appear) Estes, Staton, Wei. " A bound on the values of independence polynomials at-1/k for k-degenerate graphs " Discrete Mathematics.
متن کاملsharp bounds on the pi spectral radius
in this paper some upper and lower bounds for the greatest eigenvalues of the pi and vertex pimatrices of a graph g are obtained. those graphs for which these bounds are best possible arecharacterized.
متن کاملParameterized Complexity and Kernel Bounds for Hard Planning Problems
The propositional planning problem is a notoriously difficult computational problem. Downey et al. (1999) initiated the parameterized analysis of planning (with plan length as the parameter) and Bäckström et al. (2012) picked up this line of research and provided an extensive parameterized analysis under various restrictions, leaving open only one stubborn case. We continue this work and provid...
متن کاملComputing Lower Bounds for Steiner Trees in Road Network Design
In the automated design of road networks an important sub-task is the solution of an instance of the Steiner tree problem, a well known N P-hard problem. In this paper we present the experimental evaluation of a heuristic for the Steiner tree problem used in the design of low volume forest road networks. To evaluate a heuristic it is necessary to compare to the optimum value or a good lower bou...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2009
ISSN: 0166-218X
DOI: 10.1016/j.dam.2008.03.032